An Exact Method for the 2D Guillotine Strip Packing Problem

An Exact Method for the 2D Guillotine Strip Packing Problem

We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width W and infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one edge to the opposite edge guillotine constraint . To solve this problem, we use a dichotomic algorithm that uses a lower boun...

An exact algorithm for the Strip Packing Problem

From 13.03. to 16.03.2007, the Dagstuhl Seminar 07112 Cutting, Packing, Layout and Space Allocation was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of semi...

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

Parallelisation of the Two-dimensional Guillotine Strip Packing/Cutting Problem

A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

A heuristic recursive algorithm for the two-dimensional rectangular strip packing problem is presented. It is based on a recursive structure combined with branch-and-bound techniques. Several lengths are tried to determine the minimal plate length to hold all the items. Initially the plate is taken as a block. For the current block considered, the algorithm selects an item, puts it at the botto...